Globally Optimal O(n) Solution to the PnP Problem for General Camera Models
نویسندگان
چکیده
We present a novel and fast algorithm to solve the Perspective-n-Point problem. The PnP problem estimating the pose of a calibrated camera based on measurements and known 3D scene, is recasted as a minimization problem of the Object Space Cost. Instead of limiting the algorithm to perspective cameras, we use a formulation for general camera models. The minimization problem, together with a quaternion based representation of the rotation, is transferred into a semi definite positive program (SDP). This transfer is done in O(n) time and leads to an SDP of constant size. The solution of the SDP is a global minimizer of the PnP problem, which can be estimated in less than 0.15 seconds for 100 points.
منابع مشابه
MLPnP - A Real-Time Maximum Likelihood Solution to the Perspective-n-Point Problem
In this paper, a statistically optimal solution to the Perspective-n-Point (PnP) problem is presented. Many solutions to the PnP problem are geometrically optimal, but do not consider the uncertainties of the observations. In addition, it would be desirable to have an internal estimation of the accuracy of the estimated rotation and translation parameters of the camera pose. Thus, we propose a ...
متن کاملGlobally Optimal DLS Method for PnP Problem with Cayley parameterization
The perspective-n-point (PnP) problem, which estimates 3D rotation and translation of a calibrated camera from n pairs of known 3D points and corresponding 2D image points, is a classical problem but still fundamental in the computer vision community. It is well studied that the PnP problem can be solved by at least three points [1]. If n ≥ 4, the PnP problem becomes a nonlinear problem where t...
متن کاملEPnP: Accurate Non-Iterative O(n) Solution to the PnP Problem
We propose a non-iterative solution to the PnP problem—the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences—whose computational complexity grows linearly with n. This is in contrast to state-of-the-art methods that are O(n) or even O(n), without being more accurate. Our method is applicable for all n ≥ 4 and handles properly both planar and non-planar configur...
متن کاملCamera Arrangement in Visual 3D Systems using Iso-disparity Model to Enhance Depth Estimation Accuracy
In this paper we address the problem of automatic arrangement of cameras in a 3D system to enhance the performance of depth acquisition procedure. Lacking ground truth or a priori information, a measure of uncertainty is required to assess the quality of reconstruction. The mathematical model of iso-disparity surfaces provides an efficient way to estimate the depth estimation uncertainty which ...
متن کاملCalculating Intrinsic and Extrinsic Camera Parameters Based on the PnP Problem
The classical PnP problem is premised on given intrinsic camera parameters. However, for unknown intrinsic camera parameters, given n space points in a world coordinate system and their coordinates in an image coordinate system, the extrinsic camera parameters can be determined. Regarding the existence and uniqueness of a solution for the classical PnP problem, for 4 control points in a plane a...
متن کامل